Improving Tree Theory

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving Tree-to-Tree Translation with Packed Forests

Current tree-to-tree models suffer from parsing errors as they usually use only 1best parses for rule extraction and decoding. We instead propose a forest-based tree-to-tree model that uses packed forests. The model is based on a probabilistic synchronous tree substitution grammar (STSG), which can be learned from aligned forest pairs automatically. The decoder finds ways of decomposing trees i...

متن کامل

An Evaluation Theory Tree

O ur evaluation theory tree is presented in Figure 2.1, in which we depict the trunk and the three primary branches of the family tree. The trunk is built on a dual foundation of accountability and systematic social inquiry. These two areas have supported the development of the field in different ways. The need and desire for accountability presents a need for evaluation. The importance of acco...

متن کامل

Simple but Effective Approaches to Improving Tree-to-tree Model

Tree-to-tree translation model is widely studied in statistical machine translation (SMT) and is believed to be much potential to achieve promising translation quality. However, the existing models still suffer from the unsatisfactory performance due to the limitations both in rule extraction and decoding procedure. According to our analysis and experiments, we have found that tree-to-tree mode...

متن کامل

Improving lattice perturbation theory.

Lepage and Mackenzie have shown that tadpole renormalization and systematic improvement of lattice perturbation theory can lead to much improved numerical results in lattice gauge theory. It is shown that lattice perturbation theory using the Cayley parametrization of unitary matrices gives a simple analytical approach to tadpole renormalization, and that the Cayley parametrization gives lattic...

متن کامل

Improving the R*-tree Storage Allocation Algorithm

Geographic information systems (GISs) are one of the major applications of database systems. GISs are characterized by the huge amount of spatial data that has to be handled (in the order of thousands of terabytes, i.e. petabytes). This makes fast indexing techniques indispensable. The huge size of the databases causes indexing methods to be stored on slow secondary memory (i.e. disk), because ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annual Meeting of the Berkeley Linguistics Society

سال: 2011

ISSN: 2377-1666,0363-2946

DOI: 10.3765/bls.v11i0.1899